INCLUSION AND EXCLUSION FOR FINITELY MANY TYPES OF PROPERTIES

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Inclusion-Exclusion Principle for IF-States

Applying two definitions of the union of IF-events, P. Grzegorzewski gave two generalizations of the inclusion-exclusion principle for IF-events.In this paper we prove an inclusion-exclusion principle for IF-states based on a method which can also be used to prove Grzegorzewski's inclusion-exclusion principle for probabilities on IF-events.Finally, we give some applications of this principle by...

متن کامل

Some rank equalities for finitely many tripotent matrices

‎A rank equality is established for the sum of finitely many tripotent matrices via elementary block matrix operations‎. ‎Moreover‎, ‎by using this equality and Theorems 8 and 10 in [Chen M‎. ‎and et al‎. ‎On the open problem related to rank equalities for the sum of finitely many idempotent matrices and its applications‎, ‎The Scientific World Journal 2014 (2014)‎, ‎Article ID 702413‎, ‎7 page...

متن کامل

A Species Sampling Model with Finitely Many Types

A two-parameter family of exchangeable partitions with a simple updating rule is introduced. The partition is identified with a randomized version of a standard symmetric Dirichlet speciessampling model with finitely many types. A power-like distribution for the number of types is derived.

متن کامل

Random Walks on Trees with Finitely Many Cone Types

This paper is devoted to the study of random walks on infinite trees with finitely many cone types (also called periodic trees). We consider nearest neighbour random walks with probabilities adapted to the cone structure of the tree, which include in particular the well studied classes of simple and homesick random walks. We give a simple criterion for transience or recurrence of the random wal...

متن کامل

Inclusion-exclusion meets exclusion

When evaluating the inclusion-exclusion expansion N0 −N(1) −N(2) − · · ·+N(1, 2) +N(1, 3) + · · · many of the terms N(· · ·) may turn out to be zero, and hence should be discarded beforehand. Often this can be done.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Honam Mathematical Journal

سال: 2010

ISSN: 1225-293X

DOI: 10.5831/hmj.2010.32.1.113